New Hitech Computer Chess Success

نویسنده

  • Hans J. Berliner
چکیده

2460. Over this span it has scored 181 against players rated below it, and 38 against players rated above it. Of the eight points it lost against players rated above it, three were losses to International Grandmaster's, three were losses to International Master's, and there were two draws against players rated over 2500, (one an International Master). From previous tournaments rated by FIDE, the international chess federation, Hitech has achieved a performance worthy of a FIDE rating. However, at present FIDE is declining to rate computers. Hitech has met every qualification but one for achieving a rating—it is not a human. If Hitech were eligible for a rating, its FIDE rating would be 2350, which would qualify it for the FIDE Master title.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hitech Chess: From Master to Senior Master with no Hardware Change

Hitech has been the dominant force in computer chess from September 1985 to July 1988. During this time it has continued to use the same hardware, and yet continued to improve its standing in the US chess community from being initially in the top 2% to its present top 0.5%. We explain how this has been achieved, using better management of the resources that have been available.

متن کامل

Pattern Knowledge and Search: The SUPREM Architecture

We present a new problem solving architecture based upon extremely fast search and pattern recognition. This architecture, which we have named SUPREM, has been implemented in the chess machine/program Hitech, and has proven to be very successful. We describe the implementation in Hitech and the reasons for its success, and compare the SUPREM architecture to other well known problem solving arch...

متن کامل

Modern Masters of an Ancient Game

Computer Chess, created in 1980 to honor the first program to beat a reigning world chess champion, was awarded to the inventors of the Deep Blue chess machine Tuesday, July 29, at the annual meeting of the American Association for Artificial Intelligence (AAAI) in Providence, Rhode Island. Deep Blue beat world chess champion Gary Kasparov in the final game of a tied, six-game match last May 11...

متن کامل

The Ibm Deep Blue Supercomputer That Defeated World Chess Champion

Creating the first World Championclass chess computer belongs among the oldest challenges in computer science. When World Chess Champion Garry Kasparov resigned the last game of a six-game match against IBM’s Deep Blue supercomputer on 11 May 1997, his loss marked achievement of this goal. The quest for a “chess machine” dates back to 1769 when the Turk—with a human player hidden inside—debuted...

متن کامل

B* Probability Based Search

We describe a search algorithm for two-player games that relies on selectivity rather than brute-force to achieve success. The key ideas behind the algorithm are: 1. Stopping when one alternative is clearly better than all the others, and 2. Focusing the search on the place where the most progress can likely be made toward stopping. Critical to this process is identifying uncertainty about the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • AI Magazine

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1988